Induction of LDA Oblique Decision Rules
نویسنده
چکیده
This paper presents a new algorithm of decision rules with oblique conditions induction. It bases on the Fisher’s Linear Discriminant Analysis as a tool of finding an initial classes separation. This technique has a good ability of oblique dependencies generalisation what reduces the number of decision rules and their complexities. Keywords—classification, machine learning, Linear Discriminant Analysis, decision rules, oblique decision rules
منابع مشابه
C 5 . 1 . 3 Decision Tree Discovery
We describe the two most commonly used systems for induction of decision trees for classi cation: C4.5 and CART. We highlight the methods and di erent decisions made in each system with respect to splitting criteria, pruning, noise handling, and other di erentiating features. We describe how rules can be derived from decision trees and point to some di erence in the induction of regression tree...
متن کاملNeuroLinear: From neural networks to oblique decision rules
We present NeuroLinear, a system for extracting oblique decision rules from neural networks that have been trained for classiication of patterns. Each condition of an oblique decision rule corresponds to a partition of the attribute space by a hyperplane that is not necessarily axis-parallel. Allowing a set of such hyperplanes to form the boundaries of the decision regions leads to a signiicant...
متن کاملGlobal Induction of Decision Trees
Decision trees are, besides decision rules, one of the most popular forms of knowledge representation in Knowledge Discovery in Databases process (Fayyad, Piatetsky-Shapiro, Smyth & Uthurusamy, 1996) and implementations of the classical decision tree induction algorithms are included in the majority of data mining systems. A hierarchical structure of a tree-based classifier, where appropriate t...
متن کاملA framework for bottom-up induction of oblique decision trees
Decision-tree induction algorithms are widely used in knowledge discovery and data mining, specially in scenarios where model comprehensibility is desired. A variation of the traditional univariate approach is the so-called oblique decision tree, which allows multivariate tests in its non-terminal nodes. Oblique decision trees can model decision boundaries that are oblique to the attribute axes...
متن کاملA System for Induction of Oblique Decision
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good oblique split (in the form of a hyperplane) at each node of a decision tree. Oblique decision tree methods are tuned especially for domains in which the attributes are numeric, although they can be adapted to symbolic or...
متن کامل